Packing problem - PDFSEARCH.IO - Document Search Engine

Packing problem
Results: 195

#	Item
131	P1: SAD Journal of Heuristics KL604-03-Thesen June 23, 1998 Add to Reading List Source URL: aiinfinance.com Language: English - Date: 2012-06-26 15:09:28 Mathematical optimization Operations research Heuristics Tabu search Local search Algorithm Bin packing problem Search algorithm Greedy algorithm Mathematics Numerical analysis Applied mathematics
132	Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science, Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:04:54 NP-complete problems Combinatorics Mathematical optimization Partition problem Heuristics Graph theory Heuristic function Bin packing problem Travelling salesman problem Mathematics Theoretical computer science Computational complexity theory
133	Lecture V §1. Joy Rides Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-10-01 09:47:54 NP-complete problems Operations research Bin packing problem Mathematical optimization Greedy algorithm Minimum spanning tree Packing problem Dynamic programming Approximation algorithm Mathematics Theoretical computer science Applied mathematics
134	Optimal Rectangle Packing: Initial Results Add to Reading List Source URL: www.aaai.org Language: English - Date: 2006-01-11 07:52:01 Packaging Packing problem Quadrilaterals Rectangle Bin Algorithm Area Proportionality Largest empty rectangle Mathematics Geometry Discrete geometry
135	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
136	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
137	N = 81 N = 82 81 circles in a 1x0[removed]rectangle Add to Reading List Source URL: hydra.nat.uni-magdeburg.de Language: English - Date: 2010-08-15 03:37:38 Spheres Length Radius Rectangle Packing problem Geometry Quadrilaterals Circles
138	crc195_0[removed]ctc.ps Add to Reading List Source URL: hydra.nat.uni-magdeburg.de Language: English - Date: 2010-08-23 04:48:11 Golden ratio Elementary geometry Irrational numbers Mathematical constants Packing problem Geometry Quadrilaterals Rectangle
139	crc371_0[removed]ctc.ps Add to Reading List Source URL: hydra.nat.uni-magdeburg.de Language: English - Date: 2010-08-19 05:47:14 Golden ratio Elementary geometry Irrational numbers Mathematical constants Packing problem Geometry Quadrilaterals Rectangle
140	Lecture V §1. Joy Rides Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-10-01 09:50:59 NP-complete problems Operations research Bin packing problem Mathematical optimization Greedy algorithm Minimum spanning tree Packing problem Dynamic programming Approximation algorithm Mathematics Theoretical computer science Applied mathematics

UPDATE